منابع مشابه
Positive Inductive-Recursive Definitions
A new theory of data types which allows for the definition of types as initial algebras of certain functors Fam(C) → Fam(C) is presented. This theory, which we call positive inductive-recursive definitions, is a generalisation of Dybjer and Setzer’s theory of inductive-recursive definitions within which C had to be discrete — our work can therefore be seen as lifting this restriction. This is a...
متن کاملRecursive Stochastic Games with Positive Rewards
We study the complexity of a class of Markov decision processes and, more generally, stochastic games, called 1-exit Recursive Markov Decision Processes (1-RMDPs) and Simple Stochastic Games (1-RSSGs) with strictly positive rewards. These are a class of finitely presented countable-state zero-sum stochastic games, with total expected reward objective. They subsume standard finite-state MDPs and...
متن کاملEssential Intersection Type Assignment
This paper introduces a notion of intersection type assignment on the Lambda Calculus that is a restriction of the BCD-system as presented in [4]. This restricted system is essential in the following sense: it is an almost syntax directed system that satisfies all major properties of the BCD-system. The set of typeable terms can be characterized in the same way, the system is complete with resp...
متن کاملIntersection Type Assignment Systems
This paper gives an overview of intersection type assignment for the Lambda Calculus, as well as compare in detail variants that have been defined in the past. It presents the essential intersection type assignment system, that will prove to be as powerful as the wellknown BCD-system. It is essential in the following sense: it is an almost syntax directed system that satisfies all major propert...
متن کاملLearning Recursive Automata from Positive Examples
In this theoretical paper, we compare the “classical” learning techniques used to infer regular grammars from positive examples with the ones used to infer categorial grammars. To this aim, we first study how to translate finite state automata into categorial grammars and back. We then show that the generalization operators employed in both domains can be compared, and that their result can alw...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fundamenta Informaticae
سال: 1996
ISSN: 0169-2968
DOI: 10.3233/fi-1996-281213